Cooperation Strategies for Pursuit Games: From a Greedy to an Evolutive Approach

نویسندگان

  • Juan Reverte
  • Francisco Gallego
  • Rosana Satorre
  • Faraón Llorens-Largo
چکیده

Developing coodination among groups of agents is a big challenge in multi-agent systems. An appropriate enviroment to test new solutions is the prey-predator pursuit problem. As it is stated many times in literature, algorithms and conclusions obtained in this environment can be extended and applied to many particular problems. The first solutions for this problem proposed greedy algorithms that seemed to do the job. However, when concurrency is added to the environment it is clear that inter-agent communication and coordination is essential to achieve good results. This paper proposes two new ways to achieve agent coodination. It starts extending a well-known greedy strategy to get the best of a greedy approach. Next, a simple coodination protocol for prey-sight notice is developed. Finally, under the need of better coordination, a Neuroevolution approach is used to improve the solution. With these solutions developed, experiments are carried out and performance measures are compared. Results show that each new step represents an improvement with respect to the previous one. In conclusion, we consider this approach to be a very promising one, with still room for discussion and more improvements.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mixing Greedy and Evolutive Approaches to Improve Pursuit Strategies

The prey-predator pursuit problem is a generic multi-agent testbed referenced many times in literature. Algorithms and conclusions obtained in this domain can be extended and applied to many particular problems. In first place, greedy algorithms seem to do the job. But when concurrence problems arise, agent communication and coordination is needed to get a reasonable solution. It is quite popul...

متن کامل

Cooperative greedy pursuit strategies for sparse signal representation by partitioning

Cooperative Greedy Pursuit Strategies are considered for approximating a signal partition subjected to a global constraint on sparsity. The approach aims at producing a high quality sparse approximation of the whole signal, using highly coherent redundant dictionaries. The cooperation takes place by ranking the partition units for their sequential stepwise approximation, and is realized by mean...

متن کامل

Cooperative Orthogonal Matching Pursuit strategies for sparse approximation by partitioning

Cooperative Orthogonal Matching Pursuit strategies are considered for approximating a signal partition, subjected to a global constraint on sparsity. The approach is designed to produce a high quality sparse approximation of the whole signal, using highly coherent redundant dictionaries. The cooperation takes place by ranking the partition units for their sequential stepwise approximation and i...

متن کامل

An interval-valued programming approach to matrix games with payoffs of triangular intuitionistic fuzzy numbers

The purpose of this paper is to develop a methodology for solving a new type of matrix games in which payoffs are expressed with triangular intuitionistic fuzzy numbers (TIFNs). In this methodology, the concept of solutions for matrix games with payoffs of TIFNs is introduced. A pair of auxiliary intuitionistic fuzzy programming models for players are established to determine optimal strategies...

متن کامل

Multi - Cumulant and Non - Inferior Strategies for Multi - Player

The paper presents an extension of cost-cumulant control theory over a finite horizon for a class of two-team pursuit-evasion games wherein the evolution of the states of the game in response to decision strategies selected by pursuit and evasion teams from non-inferior sets of admissible controls is described by stochastic linear differential equation and integral quadratic cost. Since the sum...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008